One-Variable Word Equations in Linear Time
نویسندگان
چکیده
منابع مشابه
Two-Variable Word Equations
We consider languages expressed by word equations in two variables and give a complete characterization for their complexity functions, that is, the functions that give the number of words of the same length. Speci cally, we prove that there are only ve types of complexities: constant, linear, exponential, and two in between constant and linear. For the latter two, we give precise characterizat...
متن کاملA Polynomial Time Algorithm for Diophantine Equations in One Variable
We show that the integer roots of of a univariate polynomial with integer coe cients can be computed in polynomial time This re sult holds for the classical i e Turing model of computation and a sparse representation of polynomials i e coe cients and exponents are written in binary and only nonzero monomials are represented
متن کاملWord equations in linear space
Word equations (in free semigroup) are an important problem on the intersection of formal languages and algebra. Given two sequences consisting of letters and variables we are to decide whether there is a substitution for the variables that turns this formal equation into true equality of strings. The exact computational complexity of this problem remains unknown, with the best known lower and ...
متن کاملOdinger-type Equations in One Space Variable
We examine the use of orthogonal spline collocation for the semi-discretization of the cubic Schr odinger equation and the two-dimensional parabolic equation of Tappert. In each case, an optimal order L 2 estimate of the error in the semidiscrete approximation is derived. For the cubic Schr odinger equation, we present the results of numerical experiments in which the integration in time is p...
متن کاملWord Equations in Nondeterministic Linear Space
Satisfiability of word equations is an important problem in the intersection of formal languages and algebra: Given two sequences consisting of letters and variables we are to decide whether there is a substitution for the variables that turns this equation into true equality of strings. The computational complexity of this problem remains unknown, with the best lower and upper bounds being, re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2014
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-014-9931-3